翻訳と辞書 Words near each other ・ Low dead space syringe ・ Low Desert ・ Low Dietsch dialects ・ Low Dinsdale ・ Low Dinsdale Manor ・ Low Dog ・ Low Down ・ Low Down Blues ・ Low Dutch Station ・ Low Earth orbit ・ Low Ellington ・ Low Emission Development Strategies Global Partnership (LEDS GP) ・ Low emission vehicle ・ Low emissivity ・ Low End Theory ・ Low Energy Adaptive Clustering Hierarchy ・ Low Energy Antiproton Ring ・ Low Energy Dance Music ・ Low Energy Ion Ring ・ Low Estate ・ Low Etherley ・ Low Exercise Price Option ・ Low fantasy ・ Low Fell ・ Low Fell (Lake District) ・ Low Fell railway station ・ Low Fertility Cohorts Study ・ LOW Festival ・ Low Fi ・ Low fidelity Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Low Energy Adaptive Clustering Hierarchy ： ウィキペディア英語版 Low Energy Adaptive Clustering Hierarchy Low Energy Adaptive Clustering Hierarchy ("LEACH")〔Heinzelman, W., Chandrakasan, A., and Balakrishnan, H., "Energy-Efficient Communication Protocols for Wireless Microsensor Networks", Proceedings of the 33rd Hawaaian International Conference on Systems Science (HICSS), January 2000. (Paper )〕 is a TDMA-based MAC protocol which is integrated with clustering and a simple routing protocol in wireless sensor networks (WSNs). The goal of LEACH is to lower the energy consumption required to create and maintain clusters in order to improve the life time of a wireless sensor network. ==Protocol explanation== LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a stochastic algorithm at each round to determine whether it will become a cluster head in this round. LEACH assumes that each node has a radio powerful enough to directly reach the base station or the nearest cluster head, but that using this radio at full power all the time would waste energy. Nodes that have been cluster heads cannot become cluster heads again for ''P'' rounds, where ''P'' is the desired percentage of cluster heads. Thereafter, each node has a 1/''P'' probability of becoming a cluster head again. At the end of each round, each node that is not a cluster head selects the closest cluster head and joins that cluster. The cluster head then creates a schedule for each node in its cluster to transmit its data. All nodes that are not cluster heads only communicate with the cluster head in a TDMA fashion, according to the schedule created by the cluster head. They do so using the minimum energy needed to reach the cluster head, and only need to keep their radios on during their time slot. LEACH also uses CDMA so that each cluster uses a different set of CDMA codes, to minimize interference between clusters. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Low Energy Adaptive Clustering Hierarchy」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.